Vertex-Facet Incidences of Unbounded Polyhedra
نویسندگان
چکیده
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is bounded. In the case of a polyhedron that is simple and “simplicial,” i.e., a d-dimensional polyhedron that has d facets through each vertex and d vertices on each facet, we derive from the structure of the vertex-facet incidence matrix that the polyhedron is necessarily bounded. In particular, this yields a characterization of those polyhedra that have circulants as vertex-facet incidence matrices.
منابع مشابه
Computing the bounded subcomplex of an unbounded polyhedron
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results.
متن کاملlrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
This paper describes an improved implementation of the reverse search vertex enumeration/convex hull algorithm for d-dimensional convex polyhedra. The implementation uses a lexicographic ratio test to resolve degeneracy, works on bounded or unbounded polyhedra and uses exact arithmetic with all integer pivoting. It can also be used to compute the volume of the convex hull of a set of points. Fo...
متن کاملComputing the face lattice of a polytope from its vertex-facet incidences
We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m} · α · φ), where n is the number of vertices, m is the number of facets, α is the number of vertex-facet incidences, and φ is the total number of faces of P . This improves results of Fukuda and Rosta [5], who described an algorithm for enumerating...
متن کاملGenerating vertices of polyhedra and related monotone generation problems
The well-known vertex enumeration problem calls for generating all vertices of a polyhedron given by its description as a system of linear inequalities. Recently, a number of combinatorial techniques have been developed and applied successfully to a large number of monotone generation problems from different areas. We consider several such techniques and give examples in which they are applicab...
متن کامل